Circuit lower bounds in bounded arithmetics
نویسندگان
چکیده
منابع مشابه
Circuit Lower Bounds in Bounded Arithmetics
We prove that TNC1 , the true universal first-order theory in the language containing names for all uniform NC algorithms, cannot prove that for sufficiently large n, SAT is not computable by circuits of size n where k ≥ 1, c ≥ 4 unless each function f ∈ SIZE(n) can be approximated by formulas {Fn}n=1 of subexponential size 2 2/c) with subexponenital advantage: Px∈{0,1}n [Fn(x) = f(x)] ≥ 1/2 + ...
متن کاملBoolean Circuit Lower Bounds
The lectures are devoted to boolean circuit lower bounds. We consider circuits with gates ∧,∨,¬. Suppose L ∈ {0, 1}∗ is a language. Let Ln = L∩{0, 1}. We say that L is computed by a family of circuits C1, C2, . . . if on an input x = (x1, . . . , xn), Cn(x) is 1 when x ∈ Ln and is 0 when x / ∈ Ln. For a circuit C, we define size(C) to be the number of edges in the graph representing C, and dept...
متن کاملDerandomization and Circuit Lower Bounds
1 Introduction Primality testing is the following problem: Given a number n in binary, decide whether n is prime. In 1977, Solovay and Strassen [SS77] proposed a new type of algorithm for testing whether a given number is a prime, the celebrated randomized Solovay-Strassen primality test. This test and similar ones proved to be very useful. This fact changed the common notion of " feasible comp...
متن کاملAlgorithms versus Circuit Lower Bounds
Different techniques have been used to prove several transference theorems of the form “nontrivial algorithms for a circuit class C yield circuit lower bounds against C”. In this survey we revisit many of these results. We discuss how circuit lower bounds can be obtained from derandomization, compression, learning, and satisfiability algorithms. We also cover the connection between circuit lowe...
متن کاملLocality from Circuit Lower Bounds
We study the locality of an extension of first-order logic that captures graph queries computable in AC, i.e., by families of polynomial-size constant-depth circuits. The extension considers first-order formulas over relational structures which may use arbitrary numerical predicates in such a way that their truth value is independent of the particular interpretation of the numerical predicates....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2015
ISSN: 0168-0072
DOI: 10.1016/j.apal.2014.08.004